Statistical physics of the Schelling model of segregation

We investigate the static and dynamic properties of a celebrated model of social segregation, providing a complete explanation of the mechanisms leading to segregation both in one- and two-dimensional systems. Standard statistical physics methods shed light on the rich phenomenology of this simple model, exhibiting static phase transitions typical of kinetic constrained models, nontrivial coarsening like in driven-particle systems and percolation-related phenomena.Comment: 4 pages, 3 figure

Agent Based Models of Language Competition: Macroscopic descriptions and Order-Disorder transitions

We investigate the dynamics of two agent based models of language competition. In the first model, each individual can be in one of two possible states, either using language $X$ or language $Y$, while the second model incorporates a third state XY, representing individuals that use both languages (bilinguals). We analyze the models on complex networks and two-dimensional square lattices by analytical and numerical methods, and show that they exhibit a transition from one-language dominance to language coexistence. We find that the coexistence of languages is more difficult to maintain in the Bilinguals model, where the presence of bilinguals in use facilitates the ultimate dominance of one of the two languages. A stability analysis reveals that the coexistence is more unlikely to happen in poorly-connected than in fully connected networks, and that the dominance of only one language is enhanced as the connectivity decreases. This dominance effect is even stronger in a two-dimensional space, where domain coarsening tends to drive the system towards language consensus.Comment: 30 pages, 11 figure

Enhancing Robustness and Immunization in geographical networks

We find that different geographical structures of networks lead to varied percolation thresholds, although these networks may have similar abstract topological structures. Thus, the strategies for enhancing robustness and immunization of a geographical network are proposed. Using the generating function formalism, we obtain the explicit form of the percolation threshold $q_{c}$ for networks containing arbitrary order cycles. For 3-cycles, the dependence of $q_c$ on the clustering coefficients is ascertained. The analysis substantiates the validity of the strategies with an analytical evidence.Comment: 6 pages, 8 figure

Transport on weighted Networks: when correlations are independent of degree

Most real-world networks are weighted graphs with the weight of the edges reflecting the relative importance of the connections. In this work, we study non degree dependent correlations between edge weights, generalizing thus the correlations beyond the degree dependent case. We propose a simple method to introduce weight-weight correlations in topologically uncorrelated graphs. This allows us to test different measures to discriminate between the different correlation types and to quantify their intensity. We also discuss here the effect of weight correlations on the transport properties of the networks, showing that positive correlations dramatically improve transport. Finally, we give two examples of real-world networks (social and transport graphs) in which weight-weight correlations are present.Comment: 8 pages, 8 figure

A unified framework for Schelling's model of segregation

Schelling's model of segregation is one of the first and most influential models in the field of social simulation. There are many variations of the model which have been proposed and simulated over the last forty years, though the present state of the literature on the subject is somewhat fragmented and lacking comprehensive analytical treatments. In this article a unified mathematical framework for Schelling's model and its many variants is developed. This methodology is useful in two regards: firstly, it provides a tool with which to understand the differences observed between models; secondly, phenomena which appear in several model variations may be understood in more depth through analytic studies of simpler versions.Comment: 21 pages, 3 figure

Optimization in task--completion networks

We discuss the collective behavior of a network of individuals that receive, process and forward to each other tasks. Given costs they store those tasks in buffers, choosing optimally the frequency at which to check and process the buffer. The individual optimizing strategy of each node determines the aggregate behavior of the network. We find that, under general assumptions, the whole system exhibits coexistence of equilibria and hysteresis.Comment: 18 pages, 3 figures, submitted to JSTA

Topology-induced coarsening in language games

We investigate how very large populations are able to reach a global consensus, out of local “microscopic” interaction rules, in the framework of a recently introduced class of models of semiotic dynamics, the so-called naming game. We compare in particular the convergence mechanism for interacting agents embedded in a low-dimensional lattice with respect to the mean-field case. We highlight that in low dimensions consensus is reached through a coarsening process that requires less cognitive effort of the agents, with respect to the mean-field case, but takes longer to complete. In one dimension, the dynamics of the boundaries is mapped onto a truncated Markov process from which we analytically computed the diffusion coefficient. More generally we show that the convergence process requires a memory per agent scaling as N and lasts a time N1+2∕d in dimension d⩽4 (the upper critical dimension), while in mean field both memory and time scale as N3∕2, for a population of N agents. We present analytical and numerical evidence supporting this picture

Optimizing spread dynamics on graphs by message passing

Cascade processes are responsible for many important phenomena in natural and social sciences. Simple models of irreversible dynamics on graphs, in which nodes activate depending on the state of their neighbors, have been successfully applied to describe cascades in a large variety of contexts. Over the last decades, many efforts have been devoted to understand the typical behaviour of the cascades arising from initial conditions extracted at random from some given ensemble. However, the problem of optimizing the trajectory of the system, i.e. of identifying appropriate initial conditions to maximize (or minimize) the final number of active nodes, is still considered to be practically intractable, with the only exception of models that satisfy a sort of diminishing returns property called submodularity. Submodular models can be approximately solved by means of greedy strategies, but by definition they lack cooperative characteristics which are fundamental in many real systems. Here we introduce an efficient algorithm based on statistical physics for the optimization of trajectories in cascade processes on graphs. We show that for a wide class of irreversible dynamics, even in the absence of submodularity, the spread optimization problem can be solved efficiently on large networks. Analytic and algorithmic results on random graphs are complemented by the solution of the spread maximization problem on a real-world network (the Epinions consumer reviews network).Comment: Replacement for "The Spread Optimization Problem

Consensus and ordering in language dynamics

We consider two social consensus models, the AB-model and the Naming Game restricted to two conventions, which describe a population of interacting agents that can be in either of two equivalent states (A or B) or in a third mixed (AB) state. Proposed in the context of language competition and emergence, the AB state was associated with bilingualism and synonymy respectively. We show that the two models are equivalent in the mean field approximation, though the differences at the microscopic level have non-trivial consequences. To point them out, we investigate an extension of these dynamics in which confidence/trust is considered, focusing on the case of an underlying fully connected graph, and we show that the consensus-polarization phase transition taking place in the Naming Game is not observed in the AB model. We then consider the interface motion in regular lattices. Qualitatively, both models show the same behavior: a diffusive interface motion in a one-dimensional lattice, and a curvature driven dynamics with diffusing stripe-like metastable states in a two-dimensional one. However, in comparison to the Naming Game, the AB-model dynamics is shown to slow down the diffusion of such configurations.Comment: 7 pages, 6 figure

Containing Epidemic Outbreaks by Message-Passing Techniques

The problem of targeted network immunization can be defined as the one of finding a subset of nodes in a network to immunize or vaccinate in order to minimize a tradeoff between the cost of vaccination and the final (stationary) expected infection under a given epidemic model. Although computing the expected infection is a hard computational problem, simple and efficient mean-field approximations have been put forward in the literature in recent years. The optimization problem can be recast into a constrained one in which the constraints enforce local mean-field equations describing the average stationary state of the epidemic process. For a wide class of epidemic models, including the susceptible-infected-removed and the susceptible-infected-susceptible models, we define a message-passing approach to network immunization that allows us to study the statistical properties of epidemic outbreaks in the presence of immunized nodes as well as to find (nearly) optimal immunization sets for a given choice of parameters and costs. The algorithm scales linearly with the size of the graph, and it can be made efficient even on large networks. We compare its performance with topologically based heuristics, greedy methods, and simulated annealing on both random graphs and real-world networks